GraphAIR: Graph representation learning with neighborhood aggregation and interaction
نویسندگان
چکیده
Graph representation learning is of paramount importance for a variety graph analytical tasks, ranging from node classification to community detection. Recently, convolutional networks (GCNs) have been successfully applied learning. These GCNs generate by aggregating features the neighborhoods, which follows “neighborhood aggregation” scheme. In spite having achieved promising performance on various existing GCN-based models difficulty in well capturing complicated non-linearity data. this paper, we first theoretically prove that coefficients neighborhood interacting terms are relatively small current models, explains why barely outperforms linear models. Then, order better capture data, present novel GraphAIR framework interaction addition aggregation. Comprehensive experiments conducted benchmark tasks including and link prediction using public datasets demonstrate effectiveness proposed method.
منابع مشابه
Graph Representation Learning and Graph Classification
Many real-world problems are represented by using graphs. For example, given a graph of a chemical compound, we want do determine whether it causes a gene mutation or not. As another example, given a graph of a social network, we want to predict a potential friendship that does not exist but it is likely to appear soon. Many of these questions can be answered by using machine learning methods i...
متن کاملCommon Neighborhood Graph
Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...
متن کاملLearning Topic Models by Neighborhood Aggregation
Topic models are one of the most frequently used models in machine learning due to its high interpretability and modular structure. However extending the model to include supervisory signal, incorporate pre–trained word embedding vectors and add nonlinear output function to the model is not an easy task because one has to resort to highly intricate approximate inference procedure. In this paper...
متن کاملThe Common Neighborhood Graph and Its Energy
Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.
متن کاملGraph Dynamics : Learning and Representation by Andre
Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision a graph with five nodes and some edges can represent a table – where nodes correspond to particular shape descriptors for legs and a top, and edges to particular spatial rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2021
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2020.107745